TSTP Solution File: SEV043^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEV043^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 19:24:07 EDT 2023
% Result : Theorem 3.41s 3.66s
% Output : Proof 3.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV043^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : duper %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 03:28:09 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.41/3.66 SZS status Theorem for theBenchmark.p
% 3.41/3.66 SZS output start Proof for theBenchmark.p
% 3.41/3.66 Clause #0 (by assumption #[]): Eq
% 3.41/3.66 (Not
% 3.41/3.66 (∀ (Xp : a → a → Prop),
% 3.41/3.66 And (∀ (Xx Xy : a), Xp Xx Xy → Xp Xy Xx) (∀ (Xx Xy Xz : a), And (Xp Xx Xy) (Xp Xy Xz) → Xp Xx Xz) →
% 3.41/3.66 ∀ (Xx Xy : a), Xp Xx Xy → Xp Xx Xx))
% 3.41/3.66 True
% 3.41/3.66 Clause #1 (by clausification #[0]): Eq
% 3.41/3.66 (∀ (Xp : a → a → Prop),
% 3.41/3.66 And (∀ (Xx Xy : a), Xp Xx Xy → Xp Xy Xx) (∀ (Xx Xy Xz : a), And (Xp Xx Xy) (Xp Xy Xz) → Xp Xx Xz) →
% 3.41/3.66 ∀ (Xx Xy : a), Xp Xx Xy → Xp Xx Xx)
% 3.41/3.66 False
% 3.41/3.66 Clause #2 (by clausification #[1]): ∀ (a_1 : a → a → Prop),
% 3.41/3.66 Eq
% 3.41/3.66 (Not
% 3.41/3.66 (And (∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xy Xx)
% 3.41/3.66 (∀ (Xx Xy Xz : a), And (skS.0 0 a_1 Xx Xy) (skS.0 0 a_1 Xy Xz) → skS.0 0 a_1 Xx Xz) →
% 3.41/3.66 ∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xx Xx))
% 3.41/3.66 True
% 3.41/3.66 Clause #3 (by clausification #[2]): ∀ (a_1 : a → a → Prop),
% 3.41/3.66 Eq
% 3.41/3.66 (And (∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xy Xx)
% 3.41/3.66 (∀ (Xx Xy Xz : a), And (skS.0 0 a_1 Xx Xy) (skS.0 0 a_1 Xy Xz) → skS.0 0 a_1 Xx Xz) →
% 3.41/3.66 ∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xx Xx)
% 3.41/3.66 False
% 3.41/3.66 Clause #4 (by clausification #[3]): ∀ (a_1 : a → a → Prop),
% 3.41/3.66 Eq
% 3.41/3.66 (And (∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xy Xx)
% 3.41/3.66 (∀ (Xx Xy Xz : a), And (skS.0 0 a_1 Xx Xy) (skS.0 0 a_1 Xy Xz) → skS.0 0 a_1 Xx Xz))
% 3.41/3.66 True
% 3.41/3.66 Clause #5 (by clausification #[3]): ∀ (a_1 : a → a → Prop), Eq (∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xx Xx) False
% 3.41/3.66 Clause #6 (by clausification #[4]): ∀ (a_1 : a → a → Prop), Eq (∀ (Xx Xy Xz : a), And (skS.0 0 a_1 Xx Xy) (skS.0 0 a_1 Xy Xz) → skS.0 0 a_1 Xx Xz) True
% 3.41/3.66 Clause #7 (by clausification #[4]): ∀ (a_1 : a → a → Prop), Eq (∀ (Xx Xy : a), skS.0 0 a_1 Xx Xy → skS.0 0 a_1 Xy Xx) True
% 3.41/3.66 Clause #8 (by clausification #[6]): ∀ (a_1 : a → a → Prop) (a_2 : a),
% 3.41/3.66 Eq (∀ (Xy Xz : a), And (skS.0 0 a_1 a_2 Xy) (skS.0 0 a_1 Xy Xz) → skS.0 0 a_1 a_2 Xz) True
% 3.41/3.66 Clause #9 (by clausification #[8]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.41/3.66 Eq (∀ (Xz : a), And (skS.0 0 a_1 a_2 a_3) (skS.0 0 a_1 a_3 Xz) → skS.0 0 a_1 a_2 Xz) True
% 3.41/3.66 Clause #10 (by clausification #[9]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a),
% 3.41/3.66 Eq (And (skS.0 0 a_1 a_2 a_3) (skS.0 0 a_1 a_3 a_4) → skS.0 0 a_1 a_2 a_4) True
% 3.41/3.66 Clause #11 (by clausification #[10]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a),
% 3.41/3.66 Or (Eq (And (skS.0 0 a_1 a_2 a_3) (skS.0 0 a_1 a_3 a_4)) False) (Eq (skS.0 0 a_1 a_2 a_4) True)
% 3.41/3.66 Clause #12 (by clausification #[11]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a),
% 3.41/3.66 Or (Eq (skS.0 0 a_1 a_2 a_3) True) (Or (Eq (skS.0 0 a_1 a_2 a_4) False) (Eq (skS.0 0 a_1 a_4 a_3) False))
% 3.41/3.66 Clause #13 (by clausification #[5]): ∀ (a_1 : a → a → Prop) (a_2 : a),
% 3.41/3.66 Eq (Not (∀ (Xy : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy → skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2))) True
% 3.41/3.66 Clause #14 (by clausification #[13]): ∀ (a_1 : a → a → Prop) (a_2 : a),
% 3.41/3.66 Eq (∀ (Xy : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy → skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2)) False
% 3.41/3.66 Clause #15 (by clausification #[14]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.41/3.66 Eq (Not (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) → skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2))) True
% 3.41/3.66 Clause #16 (by clausification #[15]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.41/3.66 Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) → skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2)) False
% 3.41/3.66 Clause #17 (by clausification #[16]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) True
% 3.41/3.66 Clause #18 (by clausification #[16]): ∀ (a_1 : a → a → Prop) (a_2 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2)) False
% 3.41/3.66 Clause #19 (by superposition #[17, 12]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a),
% 3.41/3.66 Or (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) a_3) True)
% 3.41/3.66 (Or (Eq True False) (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_4) a_3) False))
% 3.41/3.66 Clause #20 (by clausification #[7]): ∀ (a_1 : a → a → Prop) (a_2 : a), Eq (∀ (Xy : a), skS.0 0 a_1 a_2 Xy → skS.0 0 a_1 Xy a_2) True
% 3.41/3.67 Clause #21 (by clausification #[20]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Eq (skS.0 0 a_1 a_2 a_3 → skS.0 0 a_1 a_3 a_2) True
% 3.41/3.67 Clause #22 (by clausification #[21]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Or (Eq (skS.0 0 a_1 a_2 a_3) False) (Eq (skS.0 0 a_1 a_3 a_2) True)
% 3.41/3.67 Clause #23 (by superposition #[22, 17]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.41/3.67 Or (Eq (skS.0 0 (fun x x_1 => a_1 x x_1) (skS.0 2 a_1 a_2 a_3) (skS.0 1 a_1 a_2)) True) (Eq False True)
% 3.41/3.67 Clause #24 (by betaEtaReduce #[23]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Or (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3) (skS.0 1 a_1 a_2)) True) (Eq False True)
% 3.41/3.67 Clause #25 (by clausification #[24]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3) (skS.0 1 a_1 a_2)) True
% 3.41/3.67 Clause #28 (by clausification #[19]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a),
% 3.41/3.67 Or (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) a_3) True) (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_4) a_3) False)
% 3.41/3.67 Clause #29 (by superposition #[28, 25]): ∀ (a_1 : a → a → Prop) (a_2 : a),
% 3.41/3.67 Or (Eq (skS.0 0 (fun x x_1 => a_1 x x_1) (skS.0 1 (fun x x_1 => a_1 x x_1) a_2) (skS.0 1 a_1 a_2)) True)
% 3.41/3.67 (Eq False True)
% 3.41/3.67 Clause #30 (by betaEtaReduce #[29]): ∀ (a_1 : a → a → Prop) (a_2 : a), Or (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2)) True) (Eq False True)
% 3.41/3.67 Clause #31 (by clausification #[30]): ∀ (a_1 : a → a → Prop) (a_2 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 1 a_1 a_2)) True
% 3.41/3.67 Clause #32 (by superposition #[31, 18]): Eq True False
% 3.41/3.67 Clause #34 (by clausification #[32]): False
% 3.41/3.67 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------